package 算法部分.树;

/**
 * @Author linhao
 * @Date created in 9:04 上午 2021/3/26
 */
public class RebuildBST {

    public static class Node{
        public int value;
        public Node leftNode;
        public Node rightNode;

        public Node(int v) {
            this.value = v;
        }
    }

    public static Node processFromArray(int[] arr){
        int len = arr.length;
        int result = arr[len];
        for(int i=0;i<len-1;i++){
            if(arr[i]<result){
                //left node
            }
            if(arr[i]>result){
                //right node
            }
        }
        return null;
    }

    //使用后序数组中的L->R序列中的数据构建树
    public static Node process(int arr[],int L,int R){
        Node head = new Node(arr[R]);
        return null;
    }



    public static void main(String[] args) {

    }
}
